branch and bound algorithm造句
例句與造句
- A new branch and bound algorithm for solving complex integer quadratic programs
解復雜二次整數(shù)規(guī)劃問題的新型分枝定界算法 - Branch and bound algorithm
分枝界定法 - A branch and bound algorithm for solving maximizing a concave function over weakly - efficient
弱有效集上凹函數(shù)極大問題的分枝定界算法 - Branch and bound algorithm is an important method to be used to acquire the solution of optimal problems
分支定界算法是求解優(yōu)化問題的重要方法。 - 4 . the tsp as benchmark shows that this cluster platform can increase the branch and bound algorithm ’ s efficiency and get the optimal solution soon
計算表明,在保證求得最優(yōu)解的前提下,該平臺能很好地提高分支定界算法的效率。 - It's difficult to find branch and bound algorithm in a sentence. 用branch and bound algorithm造句挺難的
- This paper consists of two parts . in the first part , a new branch and bound algorithm for minimizing the nonconvex quadratic programming with box constraints is proposed
本文分兩部分，第一部分研究求解邊界約束非凸二次規(guī)劃問題的整體最優(yōu)解的分支定界算法。 - The solving tsp ( traveling salesman problem ) examples as benchmark shows that this platform can increase the branch and bound algorithm ' s efficiency and get the optimal solution sooner
計算表明，在保證求得最優(yōu)解的前提下，該平臺能很好地提高分支定界算法的效率。 - We used heuristics branch and bound algorithm in this study since scheduling of parallel machines is a np - hard problem and we proposed four heuristics optimal scheduling algorithms in this study
根據(jù)johnson算法和并行可替換機床優(yōu)化調(diào)度算法，構(gòu)造了兩種可行的啟發(fā)式優(yōu)化調(diào)度算法，并通過數(shù)值計算，驗證了算法的有效性。 - In this thesis , the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency
本文設計實現(xiàn)的一種專用于計算分支定界算法的機群計算平臺,能減少分支定界算法的計算時間復雜度,提高分支定界算法的效率。 - A great significance of this article is that it changes the branch and bound algorithm and backtracking algorithm into application examples of the generic search algorithm of optimal problems advanced in this article
本文的一個重要意義是將回溯法和分支限界法這兩個傳統(tǒng)的算法策略轉(zhuǎn)變?yōu)楸疚乃岢龅耐ㄓ盟阉魉惴ǖ膽美印? - Methods such as branch and bound algorithm , mixed integer programming , transportation model and separable linear programming method have been used in recently years . others are heuristic methods like genetic algorithm
近年來求解選址模型用得較多的數(shù)學優(yōu)化方法有分支定界法、混合整數(shù)規(guī)劃法、運輸模型法、可分離線性規(guī)劃法。 - 2 . presenting a modified branch and bound algorithm by adding the heuristic algorithm in the cluster which increasing the efficiency of eliminating node . 3 . the problem ’ s scale is decreased through using distributed parallel computing algorithm
2 .詳細研究了幾種主要的啟發(fā)式算法,并使用啟發(fā)式算法修改了分支定界算法,在保證計算精度的前提下,提高了分支節(jié)點的淘汰效率。 - Based on our extensive study of many different scheduling optimizations , we can summarize the results into five scheduling rules . based on the rules and the heuristics branch and bound algorithm we can obtain an optimal scheduling algorithm for both layers of our model
根據(jù)不同生產(chǎn)方式優(yōu)化調(diào)度研究成果得出了五個調(diào)度規(guī)則，應用這些規(guī)則與分枝定界方法分別構(gòu)造出上、下層調(diào)度模型的啟發(fā)式分枝定界優(yōu)化算法。 - The theory results and heuristics of the maximum clique problem are described and the branch and bound algorithms are discussed in detail in this paper . based on these existing algorithms , we present a new branch and bound algorithm for the maximum weight clique problem
本文首先對當前國際上最大團問題的理論研究成果及算法研究中的啟發(fā)式算法進行了介紹，然后對精確算法中的分支定界法作了較為詳細的討論，最后作者在現(xiàn)有算法的基礎(chǔ)上，給出了最大加權(quán)團問題的一種新的分支定界算法。 - A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed , in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique
摘要構(gòu)造出了一類可分離非線性0 - 1背包問題的分枝定界算法，分枝的過程是普通的0 - 1變量分枝，用簡單的取整啟發(fā)式法確定更好的可行解；而在每個分枝結(jié)點處用線性松弛技術(shù)確定了它的子問題的一個線性規(guī)劃松弛逼近，由此得到最優(yōu)值的一個下界。
更多例句： 下一頁